<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
<span class="sourceLineNo">002</span> * Copyright (C) 2007 The Guava Authors<a name="line.2"></a>
<span class="sourceLineNo">003</span> *<a name="line.3"></a>
<span class="sourceLineNo">004</span> * Licensed under the Apache License, Version 2.0 (the "License");<a name="line.4"></a>
<span class="sourceLineNo">005</span> * you may not use this file except in compliance with the License.<a name="line.5"></a>
<span class="sourceLineNo">006</span> * You may obtain a copy of the License at<a name="line.6"></a>
<span class="sourceLineNo">007</span> *<a name="line.7"></a>
<span class="sourceLineNo">008</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.8"></a>
<span class="sourceLineNo">009</span> *<a name="line.9"></a>
<span class="sourceLineNo">010</span> * Unless required by applicable law or agreed to in writing, software<a name="line.10"></a>
<span class="sourceLineNo">011</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.11"></a>
<span class="sourceLineNo">012</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.12"></a>
<span class="sourceLineNo">013</span> * See the License for the specific language governing permissions and<a name="line.13"></a>
<span class="sourceLineNo">014</span> * limitations under the License.<a name="line.14"></a>
<span class="sourceLineNo">015</span> */<a name="line.15"></a>
<span class="sourceLineNo">016</span><a name="line.16"></a>
<span class="sourceLineNo">017</span>package com.google.common.collect;<a name="line.17"></a>
<span class="sourceLineNo">018</span><a name="line.18"></a>
<span class="sourceLineNo">019</span>import static com.google.common.base.Preconditions.checkArgument;<a name="line.19"></a>
<span class="sourceLineNo">020</span><a name="line.20"></a>
<span class="sourceLineNo">021</span>import com.google.common.annotations.GwtCompatible;<a name="line.21"></a>
<span class="sourceLineNo">022</span>import com.google.common.annotations.GwtIncompatible;<a name="line.22"></a>
<span class="sourceLineNo">023</span>import com.google.common.annotations.VisibleForTesting;<a name="line.23"></a>
<span class="sourceLineNo">024</span>import com.google.common.base.Objects;<a name="line.24"></a>
<span class="sourceLineNo">025</span>import com.google.common.primitives.Ints;<a name="line.25"></a>
<span class="sourceLineNo">026</span><a name="line.26"></a>
<span class="sourceLineNo">027</span>import java.io.IOException;<a name="line.27"></a>
<span class="sourceLineNo">028</span>import java.io.ObjectInputStream;<a name="line.28"></a>
<span class="sourceLineNo">029</span>import java.io.ObjectOutputStream;<a name="line.29"></a>
<span class="sourceLineNo">030</span>import java.util.Arrays;<a name="line.30"></a>
<span class="sourceLineNo">031</span>import java.util.Collection;<a name="line.31"></a>
<span class="sourceLineNo">032</span>import java.util.ConcurrentModificationException;<a name="line.32"></a>
<span class="sourceLineNo">033</span>import java.util.Iterator;<a name="line.33"></a>
<span class="sourceLineNo">034</span>import java.util.LinkedHashMap;<a name="line.34"></a>
<span class="sourceLineNo">035</span>import java.util.LinkedHashSet;<a name="line.35"></a>
<span class="sourceLineNo">036</span>import java.util.Map;<a name="line.36"></a>
<span class="sourceLineNo">037</span>import java.util.NoSuchElementException;<a name="line.37"></a>
<span class="sourceLineNo">038</span>import java.util.Set;<a name="line.38"></a>
<span class="sourceLineNo">039</span><a name="line.39"></a>
<span class="sourceLineNo">040</span>import javax.annotation.Nullable;<a name="line.40"></a>
<span class="sourceLineNo">041</span><a name="line.41"></a>
<span class="sourceLineNo">042</span>/**<a name="line.42"></a>
<span class="sourceLineNo">043</span> * Implementation of {@code Multimap} that does not allow duplicate key-value<a name="line.43"></a>
<span class="sourceLineNo">044</span> * entries and that returns collections whose iterators follow the ordering in<a name="line.44"></a>
<span class="sourceLineNo">045</span> * which the data was added to the multimap.<a name="line.45"></a>
<span class="sourceLineNo">046</span> *<a name="line.46"></a>
<span class="sourceLineNo">047</span> * &lt;p&gt;The collections returned by {@code keySet}, {@code keys}, and {@code<a name="line.47"></a>
<span class="sourceLineNo">048</span> * asMap} iterate through the keys in the order they were first added to the<a name="line.48"></a>
<span class="sourceLineNo">049</span> * multimap. Similarly, {@code get}, {@code removeAll}, and {@code<a name="line.49"></a>
<span class="sourceLineNo">050</span> * replaceValues} return collections that iterate through the values in the<a name="line.50"></a>
<span class="sourceLineNo">051</span> * order they were added. The collections generated by {@code entries} and<a name="line.51"></a>
<span class="sourceLineNo">052</span> * {@code values} iterate across the key-value mappings in the order they were<a name="line.52"></a>
<span class="sourceLineNo">053</span> * added to the multimap.<a name="line.53"></a>
<span class="sourceLineNo">054</span> *<a name="line.54"></a>
<span class="sourceLineNo">055</span> * &lt;p&gt;The iteration ordering of the collections generated by {@code keySet},<a name="line.55"></a>
<span class="sourceLineNo">056</span> * {@code keys}, and {@code asMap} has a few subtleties. As long as the set of<a name="line.56"></a>
<span class="sourceLineNo">057</span> * keys remains unchanged, adding or removing mappings does not affect the key<a name="line.57"></a>
<span class="sourceLineNo">058</span> * iteration order. However, if you remove all values associated with a key and<a name="line.58"></a>
<span class="sourceLineNo">059</span> * then add the key back to the multimap, that key will come last in the key<a name="line.59"></a>
<span class="sourceLineNo">060</span> * iteration order.<a name="line.60"></a>
<span class="sourceLineNo">061</span> *<a name="line.61"></a>
<span class="sourceLineNo">062</span> * &lt;p&gt;The multimap does not store duplicate key-value pairs. Adding a new<a name="line.62"></a>
<span class="sourceLineNo">063</span> * key-value pair equal to an existing key-value pair has no effect.<a name="line.63"></a>
<span class="sourceLineNo">064</span> *<a name="line.64"></a>
<span class="sourceLineNo">065</span> * &lt;p&gt;Keys and values may be null. All optional multimap methods are supported,<a name="line.65"></a>
<span class="sourceLineNo">066</span> * and all returned views are modifiable.<a name="line.66"></a>
<span class="sourceLineNo">067</span> *<a name="line.67"></a>
<span class="sourceLineNo">068</span> * &lt;p&gt;This class is not threadsafe when any concurrent operations update the<a name="line.68"></a>
<span class="sourceLineNo">069</span> * multimap. Concurrent read operations will work correctly. To allow concurrent<a name="line.69"></a>
<span class="sourceLineNo">070</span> * update operations, wrap your multimap with a call to {@link<a name="line.70"></a>
<span class="sourceLineNo">071</span> * Multimaps#synchronizedSetMultimap}.<a name="line.71"></a>
<span class="sourceLineNo">072</span> *<a name="line.72"></a>
<span class="sourceLineNo">073</span> * &lt;p&gt;See the Guava User Guide article on &lt;a href=<a name="line.73"></a>
<span class="sourceLineNo">074</span> * "http://code.google.com/p/guava-libraries/wiki/NewCollectionTypesExplained#Multimap"&gt;<a name="line.74"></a>
<span class="sourceLineNo">075</span> * {@code Multimap}&lt;/a&gt;.<a name="line.75"></a>
<span class="sourceLineNo">076</span> *<a name="line.76"></a>
<span class="sourceLineNo">077</span> * @author Jared Levy<a name="line.77"></a>
<span class="sourceLineNo">078</span> * @author Louis Wasserman<a name="line.78"></a>
<span class="sourceLineNo">079</span> * @since 2.0 (imported from Google Collections Library)<a name="line.79"></a>
<span class="sourceLineNo">080</span> */<a name="line.80"></a>
<span class="sourceLineNo">081</span>@GwtCompatible(serializable = true, emulated = true)<a name="line.81"></a>
<span class="sourceLineNo">082</span>public final class LinkedHashMultimap&lt;K, V&gt; extends AbstractSetMultimap&lt;K, V&gt; {<a name="line.82"></a>
<span class="sourceLineNo">083</span><a name="line.83"></a>
<span class="sourceLineNo">084</span>  /**<a name="line.84"></a>
<span class="sourceLineNo">085</span>   * Creates a new, empty {@code LinkedHashMultimap} with the default initial<a name="line.85"></a>
<span class="sourceLineNo">086</span>   * capacities.<a name="line.86"></a>
<span class="sourceLineNo">087</span>   */<a name="line.87"></a>
<span class="sourceLineNo">088</span>  public static &lt;K, V&gt; LinkedHashMultimap&lt;K, V&gt; create() {<a name="line.88"></a>
<span class="sourceLineNo">089</span>    return new LinkedHashMultimap&lt;K, V&gt;(DEFAULT_KEY_CAPACITY, DEFAULT_VALUE_SET_CAPACITY);<a name="line.89"></a>
<span class="sourceLineNo">090</span>  }<a name="line.90"></a>
<span class="sourceLineNo">091</span><a name="line.91"></a>
<span class="sourceLineNo">092</span>  /**<a name="line.92"></a>
<span class="sourceLineNo">093</span>   * Constructs an empty {@code LinkedHashMultimap} with enough capacity to hold<a name="line.93"></a>
<span class="sourceLineNo">094</span>   * the specified numbers of keys and values without rehashing.<a name="line.94"></a>
<span class="sourceLineNo">095</span>   *<a name="line.95"></a>
<span class="sourceLineNo">096</span>   * @param expectedKeys the expected number of distinct keys<a name="line.96"></a>
<span class="sourceLineNo">097</span>   * @param expectedValuesPerKey the expected average number of values per key<a name="line.97"></a>
<span class="sourceLineNo">098</span>   * @throws IllegalArgumentException if {@code expectedKeys} or {@code<a name="line.98"></a>
<span class="sourceLineNo">099</span>   *      expectedValuesPerKey} is negative<a name="line.99"></a>
<span class="sourceLineNo">100</span>   */<a name="line.100"></a>
<span class="sourceLineNo">101</span>  public static &lt;K, V&gt; LinkedHashMultimap&lt;K, V&gt; create(<a name="line.101"></a>
<span class="sourceLineNo">102</span>      int expectedKeys, int expectedValuesPerKey) {<a name="line.102"></a>
<span class="sourceLineNo">103</span>    return new LinkedHashMultimap&lt;K, V&gt;(<a name="line.103"></a>
<span class="sourceLineNo">104</span>        Maps.capacity(expectedKeys),<a name="line.104"></a>
<span class="sourceLineNo">105</span>        Maps.capacity(expectedValuesPerKey));<a name="line.105"></a>
<span class="sourceLineNo">106</span>  }<a name="line.106"></a>
<span class="sourceLineNo">107</span><a name="line.107"></a>
<span class="sourceLineNo">108</span>  /**<a name="line.108"></a>
<span class="sourceLineNo">109</span>   * Constructs a {@code LinkedHashMultimap} with the same mappings as the<a name="line.109"></a>
<span class="sourceLineNo">110</span>   * specified multimap. If a key-value mapping appears multiple times in the<a name="line.110"></a>
<span class="sourceLineNo">111</span>   * input multimap, it only appears once in the constructed multimap. The new<a name="line.111"></a>
<span class="sourceLineNo">112</span>   * multimap has the same {@link Multimap#entries()} iteration order as the<a name="line.112"></a>
<span class="sourceLineNo">113</span>   * input multimap, except for excluding duplicate mappings.<a name="line.113"></a>
<span class="sourceLineNo">114</span>   *<a name="line.114"></a>
<span class="sourceLineNo">115</span>   * @param multimap the multimap whose contents are copied to this multimap<a name="line.115"></a>
<span class="sourceLineNo">116</span>   */<a name="line.116"></a>
<span class="sourceLineNo">117</span>  public static &lt;K, V&gt; LinkedHashMultimap&lt;K, V&gt; create(<a name="line.117"></a>
<span class="sourceLineNo">118</span>      Multimap&lt;? extends K, ? extends V&gt; multimap) {<a name="line.118"></a>
<span class="sourceLineNo">119</span>    LinkedHashMultimap&lt;K, V&gt; result = create(multimap.keySet().size(), DEFAULT_VALUE_SET_CAPACITY);<a name="line.119"></a>
<span class="sourceLineNo">120</span>    result.putAll(multimap);<a name="line.120"></a>
<span class="sourceLineNo">121</span>    return result;<a name="line.121"></a>
<span class="sourceLineNo">122</span>  }<a name="line.122"></a>
<span class="sourceLineNo">123</span><a name="line.123"></a>
<span class="sourceLineNo">124</span>  private interface ValueSetLink&lt;K, V&gt; {<a name="line.124"></a>
<span class="sourceLineNo">125</span>    ValueSetLink&lt;K, V&gt; getPredecessorInValueSet();<a name="line.125"></a>
<span class="sourceLineNo">126</span>    ValueSetLink&lt;K, V&gt; getSuccessorInValueSet();<a name="line.126"></a>
<span class="sourceLineNo">127</span><a name="line.127"></a>
<span class="sourceLineNo">128</span>    void setPredecessorInValueSet(ValueSetLink&lt;K, V&gt; entry);<a name="line.128"></a>
<span class="sourceLineNo">129</span>    void setSuccessorInValueSet(ValueSetLink&lt;K, V&gt; entry);<a name="line.129"></a>
<span class="sourceLineNo">130</span>  }<a name="line.130"></a>
<span class="sourceLineNo">131</span><a name="line.131"></a>
<span class="sourceLineNo">132</span>  private static &lt;K, V&gt; void succeedsInValueSet(ValueSetLink&lt;K, V&gt; pred, ValueSetLink&lt;K, V&gt; succ) {<a name="line.132"></a>
<span class="sourceLineNo">133</span>    pred.setSuccessorInValueSet(succ);<a name="line.133"></a>
<span class="sourceLineNo">134</span>    succ.setPredecessorInValueSet(pred);<a name="line.134"></a>
<span class="sourceLineNo">135</span>  }<a name="line.135"></a>
<span class="sourceLineNo">136</span><a name="line.136"></a>
<span class="sourceLineNo">137</span>  private static &lt;K, V&gt; void succeedsInMultimap(<a name="line.137"></a>
<span class="sourceLineNo">138</span>      ValueEntry&lt;K, V&gt; pred, ValueEntry&lt;K, V&gt; succ) {<a name="line.138"></a>
<span class="sourceLineNo">139</span>    pred.setSuccessorInMultimap(succ);<a name="line.139"></a>
<span class="sourceLineNo">140</span>    succ.setPredecessorInMultimap(pred);<a name="line.140"></a>
<span class="sourceLineNo">141</span>  }<a name="line.141"></a>
<span class="sourceLineNo">142</span><a name="line.142"></a>
<span class="sourceLineNo">143</span>  private static &lt;K, V&gt; void deleteFromValueSet(ValueSetLink&lt;K, V&gt; entry) {<a name="line.143"></a>
<span class="sourceLineNo">144</span>    succeedsInValueSet(entry.getPredecessorInValueSet(), entry.getSuccessorInValueSet());<a name="line.144"></a>
<span class="sourceLineNo">145</span>  }<a name="line.145"></a>
<span class="sourceLineNo">146</span><a name="line.146"></a>
<span class="sourceLineNo">147</span>  private static &lt;K, V&gt; void deleteFromMultimap(ValueEntry&lt;K, V&gt; entry) {<a name="line.147"></a>
<span class="sourceLineNo">148</span>    succeedsInMultimap(entry.getPredecessorInMultimap(), entry.getSuccessorInMultimap());<a name="line.148"></a>
<span class="sourceLineNo">149</span>  }<a name="line.149"></a>
<span class="sourceLineNo">150</span><a name="line.150"></a>
<span class="sourceLineNo">151</span>  /**<a name="line.151"></a>
<span class="sourceLineNo">152</span>   * LinkedHashMultimap entries are in no less than three coexisting linked lists:<a name="line.152"></a>
<span class="sourceLineNo">153</span>   * a row in the hash table for a Set&lt;V&gt; associated with a key, the linked list<a name="line.153"></a>
<span class="sourceLineNo">154</span>   * of insertion-ordered entries in that Set&lt;V&gt;, and the linked list of entries<a name="line.154"></a>
<span class="sourceLineNo">155</span>   * in the LinkedHashMultimap as a whole.<a name="line.155"></a>
<span class="sourceLineNo">156</span>   */<a name="line.156"></a>
<span class="sourceLineNo">157</span>  private static final class ValueEntry&lt;K, V&gt; extends AbstractMapEntry&lt;K, V&gt;<a name="line.157"></a>
<span class="sourceLineNo">158</span>      implements ValueSetLink&lt;K, V&gt; {<a name="line.158"></a>
<span class="sourceLineNo">159</span>    final K key;<a name="line.159"></a>
<span class="sourceLineNo">160</span>    final V value;<a name="line.160"></a>
<span class="sourceLineNo">161</span>    final int valueHash;<a name="line.161"></a>
<span class="sourceLineNo">162</span><a name="line.162"></a>
<span class="sourceLineNo">163</span>    @Nullable ValueEntry&lt;K, V&gt; nextInValueSetHashRow;<a name="line.163"></a>
<span class="sourceLineNo">164</span><a name="line.164"></a>
<span class="sourceLineNo">165</span>    ValueSetLink&lt;K, V&gt; predecessorInValueSet;<a name="line.165"></a>
<span class="sourceLineNo">166</span>    ValueSetLink&lt;K, V&gt; successorInValueSet;<a name="line.166"></a>
<span class="sourceLineNo">167</span><a name="line.167"></a>
<span class="sourceLineNo">168</span>    ValueEntry&lt;K, V&gt; predecessorInMultimap;<a name="line.168"></a>
<span class="sourceLineNo">169</span>    ValueEntry&lt;K, V&gt; successorInMultimap;<a name="line.169"></a>
<span class="sourceLineNo">170</span><a name="line.170"></a>
<span class="sourceLineNo">171</span>    ValueEntry(@Nullable K key, @Nullable V value, int valueHash,<a name="line.171"></a>
<span class="sourceLineNo">172</span>        @Nullable ValueEntry&lt;K, V&gt; nextInValueSetHashRow) {<a name="line.172"></a>
<span class="sourceLineNo">173</span>      this.key = key;<a name="line.173"></a>
<span class="sourceLineNo">174</span>      this.value = value;<a name="line.174"></a>
<span class="sourceLineNo">175</span>      this.valueHash = valueHash;<a name="line.175"></a>
<span class="sourceLineNo">176</span>      this.nextInValueSetHashRow = nextInValueSetHashRow;<a name="line.176"></a>
<span class="sourceLineNo">177</span>    }<a name="line.177"></a>
<span class="sourceLineNo">178</span><a name="line.178"></a>
<span class="sourceLineNo">179</span>    @Override<a name="line.179"></a>
<span class="sourceLineNo">180</span>    public K getKey() {<a name="line.180"></a>
<span class="sourceLineNo">181</span>      return key;<a name="line.181"></a>
<span class="sourceLineNo">182</span>    }<a name="line.182"></a>
<span class="sourceLineNo">183</span><a name="line.183"></a>
<span class="sourceLineNo">184</span>    @Override<a name="line.184"></a>
<span class="sourceLineNo">185</span>    public V getValue() {<a name="line.185"></a>
<span class="sourceLineNo">186</span>      return value;<a name="line.186"></a>
<span class="sourceLineNo">187</span>    }<a name="line.187"></a>
<span class="sourceLineNo">188</span><a name="line.188"></a>
<span class="sourceLineNo">189</span>    @Override<a name="line.189"></a>
<span class="sourceLineNo">190</span>    public ValueSetLink&lt;K, V&gt; getPredecessorInValueSet() {<a name="line.190"></a>
<span class="sourceLineNo">191</span>      return predecessorInValueSet;<a name="line.191"></a>
<span class="sourceLineNo">192</span>    }<a name="line.192"></a>
<span class="sourceLineNo">193</span><a name="line.193"></a>
<span class="sourceLineNo">194</span>    @Override<a name="line.194"></a>
<span class="sourceLineNo">195</span>    public ValueSetLink&lt;K, V&gt; getSuccessorInValueSet() {<a name="line.195"></a>
<span class="sourceLineNo">196</span>      return successorInValueSet;<a name="line.196"></a>
<span class="sourceLineNo">197</span>    }<a name="line.197"></a>
<span class="sourceLineNo">198</span><a name="line.198"></a>
<span class="sourceLineNo">199</span>    @Override<a name="line.199"></a>
<span class="sourceLineNo">200</span>    public void setPredecessorInValueSet(ValueSetLink&lt;K, V&gt; entry) {<a name="line.200"></a>
<span class="sourceLineNo">201</span>      predecessorInValueSet = entry;<a name="line.201"></a>
<span class="sourceLineNo">202</span>    }<a name="line.202"></a>
<span class="sourceLineNo">203</span><a name="line.203"></a>
<span class="sourceLineNo">204</span>    @Override<a name="line.204"></a>
<span class="sourceLineNo">205</span>    public void setSuccessorInValueSet(ValueSetLink&lt;K, V&gt; entry) {<a name="line.205"></a>
<span class="sourceLineNo">206</span>      successorInValueSet = entry;<a name="line.206"></a>
<span class="sourceLineNo">207</span>    }<a name="line.207"></a>
<span class="sourceLineNo">208</span><a name="line.208"></a>
<span class="sourceLineNo">209</span>    public ValueEntry&lt;K, V&gt; getPredecessorInMultimap() {<a name="line.209"></a>
<span class="sourceLineNo">210</span>      return predecessorInMultimap;<a name="line.210"></a>
<span class="sourceLineNo">211</span>    }<a name="line.211"></a>
<span class="sourceLineNo">212</span><a name="line.212"></a>
<span class="sourceLineNo">213</span>    public ValueEntry&lt;K, V&gt; getSuccessorInMultimap() {<a name="line.213"></a>
<span class="sourceLineNo">214</span>      return successorInMultimap;<a name="line.214"></a>
<span class="sourceLineNo">215</span>    }<a name="line.215"></a>
<span class="sourceLineNo">216</span><a name="line.216"></a>
<span class="sourceLineNo">217</span>    public void setSuccessorInMultimap(ValueEntry&lt;K, V&gt; multimapSuccessor) {<a name="line.217"></a>
<span class="sourceLineNo">218</span>      this.successorInMultimap = multimapSuccessor;<a name="line.218"></a>
<span class="sourceLineNo">219</span>    }<a name="line.219"></a>
<span class="sourceLineNo">220</span><a name="line.220"></a>
<span class="sourceLineNo">221</span>    public void setPredecessorInMultimap(ValueEntry&lt;K, V&gt; multimapPredecessor) {<a name="line.221"></a>
<span class="sourceLineNo">222</span>      this.predecessorInMultimap = multimapPredecessor;<a name="line.222"></a>
<span class="sourceLineNo">223</span>    }<a name="line.223"></a>
<span class="sourceLineNo">224</span>  }<a name="line.224"></a>
<span class="sourceLineNo">225</span><a name="line.225"></a>
<span class="sourceLineNo">226</span>  private static final int DEFAULT_KEY_CAPACITY = 16;<a name="line.226"></a>
<span class="sourceLineNo">227</span>  private static final int DEFAULT_VALUE_SET_CAPACITY = 2;<a name="line.227"></a>
<span class="sourceLineNo">228</span><a name="line.228"></a>
<span class="sourceLineNo">229</span>  private static final int MAX_VALUE_SET_TABLE_SIZE = Ints.MAX_POWER_OF_TWO;<a name="line.229"></a>
<span class="sourceLineNo">230</span><a name="line.230"></a>
<span class="sourceLineNo">231</span>  @VisibleForTesting transient int valueSetCapacity = DEFAULT_VALUE_SET_CAPACITY;<a name="line.231"></a>
<span class="sourceLineNo">232</span>  private transient ValueEntry&lt;K, V&gt; multimapHeaderEntry;<a name="line.232"></a>
<span class="sourceLineNo">233</span><a name="line.233"></a>
<span class="sourceLineNo">234</span>  private LinkedHashMultimap(int keyCapacity, int valueSetCapacity) {<a name="line.234"></a>
<span class="sourceLineNo">235</span>    super(new LinkedHashMap&lt;K, Collection&lt;V&gt;&gt;(keyCapacity));<a name="line.235"></a>
<span class="sourceLineNo">236</span><a name="line.236"></a>
<span class="sourceLineNo">237</span>    checkArgument(valueSetCapacity &gt;= 0,<a name="line.237"></a>
<span class="sourceLineNo">238</span>        "expectedValuesPerKey must be &gt;= 0 but was %s", valueSetCapacity);<a name="line.238"></a>
<span class="sourceLineNo">239</span><a name="line.239"></a>
<span class="sourceLineNo">240</span>    this.valueSetCapacity = valueSetCapacity;<a name="line.240"></a>
<span class="sourceLineNo">241</span>    this.multimapHeaderEntry = new ValueEntry&lt;K, V&gt;(null, null, 0, null);<a name="line.241"></a>
<span class="sourceLineNo">242</span>    succeedsInMultimap(multimapHeaderEntry, multimapHeaderEntry);<a name="line.242"></a>
<span class="sourceLineNo">243</span>  }<a name="line.243"></a>
<span class="sourceLineNo">244</span><a name="line.244"></a>
<span class="sourceLineNo">245</span>  /**<a name="line.245"></a>
<span class="sourceLineNo">246</span>   * {@inheritDoc}<a name="line.246"></a>
<span class="sourceLineNo">247</span>   *<a name="line.247"></a>
<span class="sourceLineNo">248</span>   * &lt;p&gt;Creates an empty {@code LinkedHashSet} for a collection of values for<a name="line.248"></a>
<span class="sourceLineNo">249</span>   * one key.<a name="line.249"></a>
<span class="sourceLineNo">250</span>   *<a name="line.250"></a>
<span class="sourceLineNo">251</span>   * @return a new {@code LinkedHashSet} containing a collection of values for<a name="line.251"></a>
<span class="sourceLineNo">252</span>   *     one key<a name="line.252"></a>
<span class="sourceLineNo">253</span>   */<a name="line.253"></a>
<span class="sourceLineNo">254</span>  @Override<a name="line.254"></a>
<span class="sourceLineNo">255</span>  Set&lt;V&gt; createCollection() {<a name="line.255"></a>
<span class="sourceLineNo">256</span>    return new LinkedHashSet&lt;V&gt;(valueSetCapacity);<a name="line.256"></a>
<span class="sourceLineNo">257</span>  }<a name="line.257"></a>
<span class="sourceLineNo">258</span><a name="line.258"></a>
<span class="sourceLineNo">259</span>  /**<a name="line.259"></a>
<span class="sourceLineNo">260</span>   * {@inheritDoc}<a name="line.260"></a>
<span class="sourceLineNo">261</span>   *<a name="line.261"></a>
<span class="sourceLineNo">262</span>   * &lt;p&gt;Creates a decorated insertion-ordered set that also keeps track of the<a name="line.262"></a>
<span class="sourceLineNo">263</span>   * order in which key-value pairs are added to the multimap.<a name="line.263"></a>
<span class="sourceLineNo">264</span>   *<a name="line.264"></a>
<span class="sourceLineNo">265</span>   * @param key key to associate with values in the collection<a name="line.265"></a>
<span class="sourceLineNo">266</span>   * @return a new decorated set containing a collection of values for one key<a name="line.266"></a>
<span class="sourceLineNo">267</span>   */<a name="line.267"></a>
<span class="sourceLineNo">268</span>  @Override<a name="line.268"></a>
<span class="sourceLineNo">269</span>  Collection&lt;V&gt; createCollection(K key) {<a name="line.269"></a>
<span class="sourceLineNo">270</span>    return new ValueSet(key, valueSetCapacity);<a name="line.270"></a>
<span class="sourceLineNo">271</span>  }<a name="line.271"></a>
<span class="sourceLineNo">272</span><a name="line.272"></a>
<span class="sourceLineNo">273</span>  /**<a name="line.273"></a>
<span class="sourceLineNo">274</span>   * {@inheritDoc}<a name="line.274"></a>
<span class="sourceLineNo">275</span>   *<a name="line.275"></a>
<span class="sourceLineNo">276</span>   * &lt;p&gt;If {@code values} is not empty and the multimap already contains a<a name="line.276"></a>
<span class="sourceLineNo">277</span>   * mapping for {@code key}, the {@code keySet()} ordering is unchanged.<a name="line.277"></a>
<span class="sourceLineNo">278</span>   * However, the provided values always come last in the {@link #entries()} and<a name="line.278"></a>
<span class="sourceLineNo">279</span>   * {@link #values()} iteration orderings.<a name="line.279"></a>
<span class="sourceLineNo">280</span>   */<a name="line.280"></a>
<span class="sourceLineNo">281</span>  @Override<a name="line.281"></a>
<span class="sourceLineNo">282</span>  public Set&lt;V&gt; replaceValues(@Nullable K key, Iterable&lt;? extends V&gt; values) {<a name="line.282"></a>
<span class="sourceLineNo">283</span>    return super.replaceValues(key, values);<a name="line.283"></a>
<span class="sourceLineNo">284</span>  }<a name="line.284"></a>
<span class="sourceLineNo">285</span><a name="line.285"></a>
<span class="sourceLineNo">286</span>  /**<a name="line.286"></a>
<span class="sourceLineNo">287</span>   * Returns a set of all key-value pairs. Changes to the returned set will<a name="line.287"></a>
<span class="sourceLineNo">288</span>   * update the underlying multimap, and vice versa. The entries set does not<a name="line.288"></a>
<span class="sourceLineNo">289</span>   * support the {@code add} or {@code addAll} operations.<a name="line.289"></a>
<span class="sourceLineNo">290</span>   *<a name="line.290"></a>
<span class="sourceLineNo">291</span>   * &lt;p&gt;The iterator generated by the returned set traverses the entries in the<a name="line.291"></a>
<span class="sourceLineNo">292</span>   * order they were added to the multimap.<a name="line.292"></a>
<span class="sourceLineNo">293</span>   *<a name="line.293"></a>
<span class="sourceLineNo">294</span>   * &lt;p&gt;Each entry is an immutable snapshot of a key-value mapping in the<a name="line.294"></a>
<span class="sourceLineNo">295</span>   * multimap, taken at the time the entry is returned by a method call to the<a name="line.295"></a>
<span class="sourceLineNo">296</span>   * collection or its iterator.<a name="line.296"></a>
<span class="sourceLineNo">297</span>   */<a name="line.297"></a>
<span class="sourceLineNo">298</span>  @Override public Set&lt;Map.Entry&lt;K, V&gt;&gt; entries() {<a name="line.298"></a>
<span class="sourceLineNo">299</span>    return super.entries();<a name="line.299"></a>
<span class="sourceLineNo">300</span>  }<a name="line.300"></a>
<span class="sourceLineNo">301</span><a name="line.301"></a>
<span class="sourceLineNo">302</span>  /**<a name="line.302"></a>
<span class="sourceLineNo">303</span>   * Returns a collection of all values in the multimap. Changes to the returned<a name="line.303"></a>
<span class="sourceLineNo">304</span>   * collection will update the underlying multimap, and vice versa.<a name="line.304"></a>
<span class="sourceLineNo">305</span>   *<a name="line.305"></a>
<span class="sourceLineNo">306</span>   * &lt;p&gt;The iterator generated by the returned collection traverses the values<a name="line.306"></a>
<span class="sourceLineNo">307</span>   * in the order they were added to the multimap.<a name="line.307"></a>
<span class="sourceLineNo">308</span>   */<a name="line.308"></a>
<span class="sourceLineNo">309</span>  @Override public Collection&lt;V&gt; values() {<a name="line.309"></a>
<span class="sourceLineNo">310</span>    return super.values();<a name="line.310"></a>
<span class="sourceLineNo">311</span>  }<a name="line.311"></a>
<span class="sourceLineNo">312</span><a name="line.312"></a>
<span class="sourceLineNo">313</span>  @VisibleForTesting<a name="line.313"></a>
<span class="sourceLineNo">314</span>  final class ValueSet extends Sets.ImprovedAbstractSet&lt;V&gt; implements ValueSetLink&lt;K, V&gt; {<a name="line.314"></a>
<span class="sourceLineNo">315</span>    /*<a name="line.315"></a>
<span class="sourceLineNo">316</span>     * We currently use a fixed load factor of 1.0, a bit higher than normal to reduce memory<a name="line.316"></a>
<span class="sourceLineNo">317</span>     * consumption.<a name="line.317"></a>
<span class="sourceLineNo">318</span>     */<a name="line.318"></a>
<span class="sourceLineNo">319</span><a name="line.319"></a>
<span class="sourceLineNo">320</span>    private final K key;<a name="line.320"></a>
<span class="sourceLineNo">321</span>    private ValueEntry&lt;K, V&gt;[] hashTable;<a name="line.321"></a>
<span class="sourceLineNo">322</span>    private int size = 0;<a name="line.322"></a>
<span class="sourceLineNo">323</span>    private int modCount = 0;<a name="line.323"></a>
<span class="sourceLineNo">324</span><a name="line.324"></a>
<span class="sourceLineNo">325</span>    // We use the set object itself as the end of the linked list, avoiding an unnecessary<a name="line.325"></a>
<span class="sourceLineNo">326</span>    // entry object per key.<a name="line.326"></a>
<span class="sourceLineNo">327</span>    private ValueSetLink&lt;K, V&gt; firstEntry;<a name="line.327"></a>
<span class="sourceLineNo">328</span>    private ValueSetLink&lt;K, V&gt; lastEntry;<a name="line.328"></a>
<span class="sourceLineNo">329</span><a name="line.329"></a>
<span class="sourceLineNo">330</span>    ValueSet(K key, int expectedValues) {<a name="line.330"></a>
<span class="sourceLineNo">331</span>      this.key = key;<a name="line.331"></a>
<span class="sourceLineNo">332</span>      this.firstEntry = this;<a name="line.332"></a>
<span class="sourceLineNo">333</span>      this.lastEntry = this;<a name="line.333"></a>
<span class="sourceLineNo">334</span>      // Round expected values up to a power of 2 to get the table size.<a name="line.334"></a>
<span class="sourceLineNo">335</span>      int tableSize = Integer.highestOneBit(Math.max(expectedValues, 2) - 1) &lt;&lt; 1;<a name="line.335"></a>
<span class="sourceLineNo">336</span>      if (tableSize &lt; 0) {<a name="line.336"></a>
<span class="sourceLineNo">337</span>        tableSize = MAX_VALUE_SET_TABLE_SIZE;<a name="line.337"></a>
<span class="sourceLineNo">338</span>      }<a name="line.338"></a>
<span class="sourceLineNo">339</span><a name="line.339"></a>
<span class="sourceLineNo">340</span>      @SuppressWarnings("unchecked")<a name="line.340"></a>
<span class="sourceLineNo">341</span>      ValueEntry&lt;K, V&gt;[] hashTable = new ValueEntry[tableSize];<a name="line.341"></a>
<span class="sourceLineNo">342</span>      this.hashTable = hashTable;<a name="line.342"></a>
<span class="sourceLineNo">343</span>    }<a name="line.343"></a>
<span class="sourceLineNo">344</span><a name="line.344"></a>
<span class="sourceLineNo">345</span>    @Override<a name="line.345"></a>
<span class="sourceLineNo">346</span>    public ValueSetLink&lt;K, V&gt; getPredecessorInValueSet() {<a name="line.346"></a>
<span class="sourceLineNo">347</span>      return lastEntry;<a name="line.347"></a>
<span class="sourceLineNo">348</span>    }<a name="line.348"></a>
<span class="sourceLineNo">349</span><a name="line.349"></a>
<span class="sourceLineNo">350</span>    @Override<a name="line.350"></a>
<span class="sourceLineNo">351</span>    public ValueSetLink&lt;K, V&gt; getSuccessorInValueSet() {<a name="line.351"></a>
<span class="sourceLineNo">352</span>      return firstEntry;<a name="line.352"></a>
<span class="sourceLineNo">353</span>    }<a name="line.353"></a>
<span class="sourceLineNo">354</span><a name="line.354"></a>
<span class="sourceLineNo">355</span>    @Override<a name="line.355"></a>
<span class="sourceLineNo">356</span>    public void setPredecessorInValueSet(ValueSetLink&lt;K, V&gt; entry) {<a name="line.356"></a>
<span class="sourceLineNo">357</span>      lastEntry = entry;<a name="line.357"></a>
<span class="sourceLineNo">358</span>    }<a name="line.358"></a>
<span class="sourceLineNo">359</span><a name="line.359"></a>
<span class="sourceLineNo">360</span>    @Override<a name="line.360"></a>
<span class="sourceLineNo">361</span>    public void setSuccessorInValueSet(ValueSetLink&lt;K, V&gt; entry) {<a name="line.361"></a>
<span class="sourceLineNo">362</span>      firstEntry = entry;<a name="line.362"></a>
<span class="sourceLineNo">363</span>    }<a name="line.363"></a>
<span class="sourceLineNo">364</span><a name="line.364"></a>
<span class="sourceLineNo">365</span>    @Override<a name="line.365"></a>
<span class="sourceLineNo">366</span>    public Iterator&lt;V&gt; iterator() {<a name="line.366"></a>
<span class="sourceLineNo">367</span>      return new Iterator&lt;V&gt;() {<a name="line.367"></a>
<span class="sourceLineNo">368</span>        ValueSetLink&lt;K, V&gt; nextEntry = firstEntry;<a name="line.368"></a>
<span class="sourceLineNo">369</span>        ValueEntry&lt;K, V&gt; toRemove;<a name="line.369"></a>
<span class="sourceLineNo">370</span>        int expectedModCount = modCount;<a name="line.370"></a>
<span class="sourceLineNo">371</span><a name="line.371"></a>
<span class="sourceLineNo">372</span>        private void checkForComodification() {<a name="line.372"></a>
<span class="sourceLineNo">373</span>          if (modCount != expectedModCount) {<a name="line.373"></a>
<span class="sourceLineNo">374</span>            throw new ConcurrentModificationException();<a name="line.374"></a>
<span class="sourceLineNo">375</span>          }<a name="line.375"></a>
<span class="sourceLineNo">376</span>        }<a name="line.376"></a>
<span class="sourceLineNo">377</span><a name="line.377"></a>
<span class="sourceLineNo">378</span>        @Override<a name="line.378"></a>
<span class="sourceLineNo">379</span>        public boolean hasNext() {<a name="line.379"></a>
<span class="sourceLineNo">380</span>          checkForComodification();<a name="line.380"></a>
<span class="sourceLineNo">381</span>          return nextEntry != ValueSet.this;<a name="line.381"></a>
<span class="sourceLineNo">382</span>        }<a name="line.382"></a>
<span class="sourceLineNo">383</span><a name="line.383"></a>
<span class="sourceLineNo">384</span>        @Override<a name="line.384"></a>
<span class="sourceLineNo">385</span>        public V next() {<a name="line.385"></a>
<span class="sourceLineNo">386</span>          if (!hasNext()) {<a name="line.386"></a>
<span class="sourceLineNo">387</span>            throw new NoSuchElementException();<a name="line.387"></a>
<span class="sourceLineNo">388</span>          }<a name="line.388"></a>
<span class="sourceLineNo">389</span>          ValueEntry&lt;K, V&gt; entry = (ValueEntry&lt;K, V&gt;) nextEntry;<a name="line.389"></a>
<span class="sourceLineNo">390</span>          V result = entry.getValue();<a name="line.390"></a>
<span class="sourceLineNo">391</span>          toRemove = entry;<a name="line.391"></a>
<span class="sourceLineNo">392</span>          nextEntry = entry.getSuccessorInValueSet();<a name="line.392"></a>
<span class="sourceLineNo">393</span>          return result;<a name="line.393"></a>
<span class="sourceLineNo">394</span>        }<a name="line.394"></a>
<span class="sourceLineNo">395</span><a name="line.395"></a>
<span class="sourceLineNo">396</span>        @Override<a name="line.396"></a>
<span class="sourceLineNo">397</span>        public void remove() {<a name="line.397"></a>
<span class="sourceLineNo">398</span>          checkForComodification();<a name="line.398"></a>
<span class="sourceLineNo">399</span>          Iterators.checkRemove(toRemove != null);<a name="line.399"></a>
<span class="sourceLineNo">400</span>          Object o = toRemove.getValue();<a name="line.400"></a>
<span class="sourceLineNo">401</span>          int hash = (o == null) ? 0 : o.hashCode();<a name="line.401"></a>
<span class="sourceLineNo">402</span>          int row = Hashing.smear(hash) &amp; (hashTable.length - 1);<a name="line.402"></a>
<span class="sourceLineNo">403</span>          ValueEntry&lt;K, V&gt; prev = null;<a name="line.403"></a>
<span class="sourceLineNo">404</span>          for (ValueEntry&lt;K, V&gt; entry = hashTable[row]; entry != null;<a name="line.404"></a>
<span class="sourceLineNo">405</span>               prev = entry, entry = entry.nextInValueSetHashRow) {<a name="line.405"></a>
<span class="sourceLineNo">406</span>            if (entry == toRemove) {<a name="line.406"></a>
<span class="sourceLineNo">407</span>              if (prev == null) {<a name="line.407"></a>
<span class="sourceLineNo">408</span>                // first entry in row<a name="line.408"></a>
<span class="sourceLineNo">409</span>                hashTable[row] = entry.nextInValueSetHashRow;<a name="line.409"></a>
<span class="sourceLineNo">410</span>              } else {<a name="line.410"></a>
<span class="sourceLineNo">411</span>                prev.nextInValueSetHashRow = entry.nextInValueSetHashRow;<a name="line.411"></a>
<span class="sourceLineNo">412</span>              }<a name="line.412"></a>
<span class="sourceLineNo">413</span>              deleteFromValueSet(toRemove);<a name="line.413"></a>
<span class="sourceLineNo">414</span>              deleteFromMultimap(toRemove);<a name="line.414"></a>
<span class="sourceLineNo">415</span>              size--;<a name="line.415"></a>
<span class="sourceLineNo">416</span>              expectedModCount = ++modCount;<a name="line.416"></a>
<span class="sourceLineNo">417</span>              break;<a name="line.417"></a>
<span class="sourceLineNo">418</span>            }<a name="line.418"></a>
<span class="sourceLineNo">419</span>          }<a name="line.419"></a>
<span class="sourceLineNo">420</span>          toRemove = null;<a name="line.420"></a>
<span class="sourceLineNo">421</span>        }<a name="line.421"></a>
<span class="sourceLineNo">422</span>      };<a name="line.422"></a>
<span class="sourceLineNo">423</span>    }<a name="line.423"></a>
<span class="sourceLineNo">424</span><a name="line.424"></a>
<span class="sourceLineNo">425</span>    @Override<a name="line.425"></a>
<span class="sourceLineNo">426</span>    public int size() {<a name="line.426"></a>
<span class="sourceLineNo">427</span>      return size;<a name="line.427"></a>
<span class="sourceLineNo">428</span>    }<a name="line.428"></a>
<span class="sourceLineNo">429</span><a name="line.429"></a>
<span class="sourceLineNo">430</span>    @Override<a name="line.430"></a>
<span class="sourceLineNo">431</span>    public boolean contains(@Nullable Object o) {<a name="line.431"></a>
<span class="sourceLineNo">432</span>      int hash = (o == null) ? 0 : o.hashCode();<a name="line.432"></a>
<span class="sourceLineNo">433</span>      int row = Hashing.smear(hash) &amp; (hashTable.length - 1);<a name="line.433"></a>
<span class="sourceLineNo">434</span><a name="line.434"></a>
<span class="sourceLineNo">435</span>      for (ValueEntry&lt;K, V&gt; entry = hashTable[row]; entry != null;<a name="line.435"></a>
<span class="sourceLineNo">436</span>          entry = entry.nextInValueSetHashRow) {<a name="line.436"></a>
<span class="sourceLineNo">437</span>        if (hash == entry.valueHash &amp;&amp; Objects.equal(o, entry.getValue())) {<a name="line.437"></a>
<span class="sourceLineNo">438</span>          return true;<a name="line.438"></a>
<span class="sourceLineNo">439</span>        }<a name="line.439"></a>
<span class="sourceLineNo">440</span>      }<a name="line.440"></a>
<span class="sourceLineNo">441</span>      return false;<a name="line.441"></a>
<span class="sourceLineNo">442</span>    }<a name="line.442"></a>
<span class="sourceLineNo">443</span><a name="line.443"></a>
<span class="sourceLineNo">444</span>    /**<a name="line.444"></a>
<span class="sourceLineNo">445</span>     * The threshold above which the hash table should be rebuilt.<a name="line.445"></a>
<span class="sourceLineNo">446</span>     */<a name="line.446"></a>
<span class="sourceLineNo">447</span>    @VisibleForTesting int threshold() {<a name="line.447"></a>
<span class="sourceLineNo">448</span>      return hashTable.length; // load factor of 1.0<a name="line.448"></a>
<span class="sourceLineNo">449</span>    }<a name="line.449"></a>
<span class="sourceLineNo">450</span><a name="line.450"></a>
<span class="sourceLineNo">451</span>    @Override<a name="line.451"></a>
<span class="sourceLineNo">452</span>    public boolean add(@Nullable V value) {<a name="line.452"></a>
<span class="sourceLineNo">453</span>      int hash = (value == null) ? 0 : value.hashCode();<a name="line.453"></a>
<span class="sourceLineNo">454</span>      int row = Hashing.smear(hash) &amp; (hashTable.length - 1);<a name="line.454"></a>
<span class="sourceLineNo">455</span><a name="line.455"></a>
<span class="sourceLineNo">456</span>      ValueEntry&lt;K, V&gt; rowHead = hashTable[row];<a name="line.456"></a>
<span class="sourceLineNo">457</span>      for (ValueEntry&lt;K, V&gt; entry = rowHead; entry != null;<a name="line.457"></a>
<span class="sourceLineNo">458</span>          entry = entry.nextInValueSetHashRow) {<a name="line.458"></a>
<span class="sourceLineNo">459</span>        if (hash == entry.valueHash &amp;&amp; Objects.equal(value, entry.getValue())) {<a name="line.459"></a>
<span class="sourceLineNo">460</span>          return false;<a name="line.460"></a>
<span class="sourceLineNo">461</span>        }<a name="line.461"></a>
<span class="sourceLineNo">462</span>      }<a name="line.462"></a>
<span class="sourceLineNo">463</span><a name="line.463"></a>
<span class="sourceLineNo">464</span>      ValueEntry&lt;K, V&gt; newEntry = new ValueEntry&lt;K, V&gt;(key, value, hash, rowHead);<a name="line.464"></a>
<span class="sourceLineNo">465</span>      succeedsInValueSet(lastEntry, newEntry);<a name="line.465"></a>
<span class="sourceLineNo">466</span>      succeedsInValueSet(newEntry, this);<a name="line.466"></a>
<span class="sourceLineNo">467</span>      succeedsInMultimap(multimapHeaderEntry.getPredecessorInMultimap(), newEntry);<a name="line.467"></a>
<span class="sourceLineNo">468</span>      succeedsInMultimap(newEntry, multimapHeaderEntry);<a name="line.468"></a>
<span class="sourceLineNo">469</span>      hashTable[row] = newEntry;<a name="line.469"></a>
<span class="sourceLineNo">470</span>      size++;<a name="line.470"></a>
<span class="sourceLineNo">471</span>      modCount++;<a name="line.471"></a>
<span class="sourceLineNo">472</span>      rehashIfNecessary();<a name="line.472"></a>
<span class="sourceLineNo">473</span>      return true;<a name="line.473"></a>
<span class="sourceLineNo">474</span>    }<a name="line.474"></a>
<span class="sourceLineNo">475</span><a name="line.475"></a>
<span class="sourceLineNo">476</span>    private void rehashIfNecessary() {<a name="line.476"></a>
<span class="sourceLineNo">477</span>      if (size &gt; threshold() &amp;&amp; hashTable.length &lt; MAX_VALUE_SET_TABLE_SIZE) {<a name="line.477"></a>
<span class="sourceLineNo">478</span>        @SuppressWarnings("unchecked")<a name="line.478"></a>
<span class="sourceLineNo">479</span>        ValueEntry&lt;K, V&gt;[] hashTable = new ValueEntry[this.hashTable.length * 2];<a name="line.479"></a>
<span class="sourceLineNo">480</span>        this.hashTable = hashTable;<a name="line.480"></a>
<span class="sourceLineNo">481</span>        int mask = hashTable.length - 1;<a name="line.481"></a>
<span class="sourceLineNo">482</span>        for (ValueSetLink&lt;K, V&gt; entry = firstEntry;<a name="line.482"></a>
<span class="sourceLineNo">483</span>              entry != this; entry = entry.getSuccessorInValueSet()) {<a name="line.483"></a>
<span class="sourceLineNo">484</span>          ValueEntry&lt;K, V&gt; valueEntry = (ValueEntry&lt;K, V&gt;) entry;<a name="line.484"></a>
<span class="sourceLineNo">485</span>          int row = Hashing.smear(valueEntry.valueHash) &amp; mask;<a name="line.485"></a>
<span class="sourceLineNo">486</span>          valueEntry.nextInValueSetHashRow = hashTable[row];<a name="line.486"></a>
<span class="sourceLineNo">487</span>          hashTable[row] = valueEntry;<a name="line.487"></a>
<span class="sourceLineNo">488</span>        }<a name="line.488"></a>
<span class="sourceLineNo">489</span>      }<a name="line.489"></a>
<span class="sourceLineNo">490</span>    }<a name="line.490"></a>
<span class="sourceLineNo">491</span><a name="line.491"></a>
<span class="sourceLineNo">492</span>    @Override<a name="line.492"></a>
<span class="sourceLineNo">493</span>    public boolean remove(@Nullable Object o) {<a name="line.493"></a>
<span class="sourceLineNo">494</span>      int hash = (o == null) ? 0 : o.hashCode();<a name="line.494"></a>
<span class="sourceLineNo">495</span>      int row = Hashing.smear(hash) &amp; (hashTable.length - 1);<a name="line.495"></a>
<span class="sourceLineNo">496</span><a name="line.496"></a>
<span class="sourceLineNo">497</span>      ValueEntry&lt;K, V&gt; prev = null;<a name="line.497"></a>
<span class="sourceLineNo">498</span>      for (ValueEntry&lt;K, V&gt; entry = hashTable[row]; entry != null;<a name="line.498"></a>
<span class="sourceLineNo">499</span>           prev = entry, entry = entry.nextInValueSetHashRow) {<a name="line.499"></a>
<span class="sourceLineNo">500</span>        if (hash == entry.valueHash &amp;&amp; Objects.equal(o, entry.getValue())) {<a name="line.500"></a>
<span class="sourceLineNo">501</span>          if (prev == null) {<a name="line.501"></a>
<span class="sourceLineNo">502</span>            // first entry in the row<a name="line.502"></a>
<span class="sourceLineNo">503</span>            hashTable[row] = entry.nextInValueSetHashRow;<a name="line.503"></a>
<span class="sourceLineNo">504</span>          } else {<a name="line.504"></a>
<span class="sourceLineNo">505</span>            prev.nextInValueSetHashRow = entry.nextInValueSetHashRow;<a name="line.505"></a>
<span class="sourceLineNo">506</span>          }<a name="line.506"></a>
<span class="sourceLineNo">507</span>          deleteFromValueSet(entry);<a name="line.507"></a>
<span class="sourceLineNo">508</span>          deleteFromMultimap(entry);<a name="line.508"></a>
<span class="sourceLineNo">509</span>          size--;<a name="line.509"></a>
<span class="sourceLineNo">510</span>          modCount++;<a name="line.510"></a>
<span class="sourceLineNo">511</span>          return true;<a name="line.511"></a>
<span class="sourceLineNo">512</span>        }<a name="line.512"></a>
<span class="sourceLineNo">513</span>      }<a name="line.513"></a>
<span class="sourceLineNo">514</span>      return false;<a name="line.514"></a>
<span class="sourceLineNo">515</span>    }<a name="line.515"></a>
<span class="sourceLineNo">516</span><a name="line.516"></a>
<span class="sourceLineNo">517</span>    @Override<a name="line.517"></a>
<span class="sourceLineNo">518</span>    public void clear() {<a name="line.518"></a>
<span class="sourceLineNo">519</span>      Arrays.fill(hashTable, null);<a name="line.519"></a>
<span class="sourceLineNo">520</span>      size = 0;<a name="line.520"></a>
<span class="sourceLineNo">521</span>      for (ValueSetLink&lt;K, V&gt; entry = firstEntry;<a name="line.521"></a>
<span class="sourceLineNo">522</span>           entry != this; entry = entry.getSuccessorInValueSet()) {<a name="line.522"></a>
<span class="sourceLineNo">523</span>        ValueEntry&lt;K, V&gt; valueEntry = (ValueEntry&lt;K, V&gt;) entry;<a name="line.523"></a>
<span class="sourceLineNo">524</span>        deleteFromMultimap(valueEntry);<a name="line.524"></a>
<span class="sourceLineNo">525</span>      }<a name="line.525"></a>
<span class="sourceLineNo">526</span>      succeedsInValueSet(this, this);<a name="line.526"></a>
<span class="sourceLineNo">527</span>      modCount++;<a name="line.527"></a>
<span class="sourceLineNo">528</span>    }<a name="line.528"></a>
<span class="sourceLineNo">529</span>  }<a name="line.529"></a>
<span class="sourceLineNo">530</span><a name="line.530"></a>
<span class="sourceLineNo">531</span>  @Override<a name="line.531"></a>
<span class="sourceLineNo">532</span>  Iterator&lt;Map.Entry&lt;K, V&gt;&gt; createEntryIterator() {<a name="line.532"></a>
<span class="sourceLineNo">533</span>    return new Iterator&lt;Map.Entry&lt;K, V&gt;&gt;() {<a name="line.533"></a>
<span class="sourceLineNo">534</span>      ValueEntry&lt;K, V&gt; nextEntry = multimapHeaderEntry.successorInMultimap;<a name="line.534"></a>
<span class="sourceLineNo">535</span>      ValueEntry&lt;K, V&gt; toRemove;<a name="line.535"></a>
<span class="sourceLineNo">536</span><a name="line.536"></a>
<span class="sourceLineNo">537</span>      @Override<a name="line.537"></a>
<span class="sourceLineNo">538</span>      public boolean hasNext() {<a name="line.538"></a>
<span class="sourceLineNo">539</span>        return nextEntry != multimapHeaderEntry;<a name="line.539"></a>
<span class="sourceLineNo">540</span>      }<a name="line.540"></a>
<span class="sourceLineNo">541</span><a name="line.541"></a>
<span class="sourceLineNo">542</span>      @Override<a name="line.542"></a>
<span class="sourceLineNo">543</span>      public Map.Entry&lt;K, V&gt; next() {<a name="line.543"></a>
<span class="sourceLineNo">544</span>        if (!hasNext()) {<a name="line.544"></a>
<span class="sourceLineNo">545</span>          throw new NoSuchElementException();<a name="line.545"></a>
<span class="sourceLineNo">546</span>        }<a name="line.546"></a>
<span class="sourceLineNo">547</span>        ValueEntry&lt;K, V&gt; result = nextEntry;<a name="line.547"></a>
<span class="sourceLineNo">548</span>        toRemove = result;<a name="line.548"></a>
<span class="sourceLineNo">549</span>        nextEntry = nextEntry.successorInMultimap;<a name="line.549"></a>
<span class="sourceLineNo">550</span>        return result;<a name="line.550"></a>
<span class="sourceLineNo">551</span>      }<a name="line.551"></a>
<span class="sourceLineNo">552</span><a name="line.552"></a>
<span class="sourceLineNo">553</span>      @Override<a name="line.553"></a>
<span class="sourceLineNo">554</span>      public void remove() {<a name="line.554"></a>
<span class="sourceLineNo">555</span>        Iterators.checkRemove(toRemove != null);<a name="line.555"></a>
<span class="sourceLineNo">556</span>        LinkedHashMultimap.this.remove(toRemove.getKey(), toRemove.getValue());<a name="line.556"></a>
<span class="sourceLineNo">557</span>        toRemove = null;<a name="line.557"></a>
<span class="sourceLineNo">558</span>      }<a name="line.558"></a>
<span class="sourceLineNo">559</span>    };<a name="line.559"></a>
<span class="sourceLineNo">560</span>  }<a name="line.560"></a>
<span class="sourceLineNo">561</span><a name="line.561"></a>
<span class="sourceLineNo">562</span>  @Override<a name="line.562"></a>
<span class="sourceLineNo">563</span>  public void clear() {<a name="line.563"></a>
<span class="sourceLineNo">564</span>    super.clear();<a name="line.564"></a>
<span class="sourceLineNo">565</span>    succeedsInMultimap(multimapHeaderEntry, multimapHeaderEntry);<a name="line.565"></a>
<span class="sourceLineNo">566</span>  }<a name="line.566"></a>
<span class="sourceLineNo">567</span><a name="line.567"></a>
<span class="sourceLineNo">568</span>  /**<a name="line.568"></a>
<span class="sourceLineNo">569</span>   * @serialData the expected values per key, the number of distinct keys,<a name="line.569"></a>
<span class="sourceLineNo">570</span>   * the number of entries, and the entries in order<a name="line.570"></a>
<span class="sourceLineNo">571</span>   */<a name="line.571"></a>
<span class="sourceLineNo">572</span>  @GwtIncompatible("java.io.ObjectOutputStream")<a name="line.572"></a>
<span class="sourceLineNo">573</span>  private void writeObject(ObjectOutputStream stream) throws IOException {<a name="line.573"></a>
<span class="sourceLineNo">574</span>    stream.defaultWriteObject();<a name="line.574"></a>
<span class="sourceLineNo">575</span>    stream.writeInt(valueSetCapacity);<a name="line.575"></a>
<span class="sourceLineNo">576</span>    stream.writeInt(keySet().size());<a name="line.576"></a>
<span class="sourceLineNo">577</span>    for (K key : keySet()) {<a name="line.577"></a>
<span class="sourceLineNo">578</span>      stream.writeObject(key);<a name="line.578"></a>
<span class="sourceLineNo">579</span>    }<a name="line.579"></a>
<span class="sourceLineNo">580</span>    stream.writeInt(size());<a name="line.580"></a>
<span class="sourceLineNo">581</span>    for (Map.Entry&lt;K, V&gt; entry : entries()) {<a name="line.581"></a>
<span class="sourceLineNo">582</span>      stream.writeObject(entry.getKey());<a name="line.582"></a>
<span class="sourceLineNo">583</span>      stream.writeObject(entry.getValue());<a name="line.583"></a>
<span class="sourceLineNo">584</span>    }<a name="line.584"></a>
<span class="sourceLineNo">585</span>  }<a name="line.585"></a>
<span class="sourceLineNo">586</span><a name="line.586"></a>
<span class="sourceLineNo">587</span>  @GwtIncompatible("java.io.ObjectInputStream")<a name="line.587"></a>
<span class="sourceLineNo">588</span>  private void readObject(ObjectInputStream stream)<a name="line.588"></a>
<span class="sourceLineNo">589</span>      throws IOException, ClassNotFoundException {<a name="line.589"></a>
<span class="sourceLineNo">590</span>    stream.defaultReadObject();<a name="line.590"></a>
<span class="sourceLineNo">591</span>    multimapHeaderEntry = new ValueEntry&lt;K, V&gt;(null, null, 0, null);<a name="line.591"></a>
<span class="sourceLineNo">592</span>    succeedsInMultimap(multimapHeaderEntry, multimapHeaderEntry);<a name="line.592"></a>
<span class="sourceLineNo">593</span>    valueSetCapacity = stream.readInt();<a name="line.593"></a>
<span class="sourceLineNo">594</span>    int distinctKeys = stream.readInt();<a name="line.594"></a>
<span class="sourceLineNo">595</span>    Map&lt;K, Collection&lt;V&gt;&gt; map =<a name="line.595"></a>
<span class="sourceLineNo">596</span>        new LinkedHashMap&lt;K, Collection&lt;V&gt;&gt;(Maps.capacity(distinctKeys));<a name="line.596"></a>
<span class="sourceLineNo">597</span>    for (int i = 0; i &lt; distinctKeys; i++) {<a name="line.597"></a>
<span class="sourceLineNo">598</span>      @SuppressWarnings("unchecked")<a name="line.598"></a>
<span class="sourceLineNo">599</span>      K key = (K) stream.readObject();<a name="line.599"></a>
<span class="sourceLineNo">600</span>      map.put(key, createCollection(key));<a name="line.600"></a>
<span class="sourceLineNo">601</span>    }<a name="line.601"></a>
<span class="sourceLineNo">602</span>    int entries = stream.readInt();<a name="line.602"></a>
<span class="sourceLineNo">603</span>    for (int i = 0; i &lt; entries; i++) {<a name="line.603"></a>
<span class="sourceLineNo">604</span>      @SuppressWarnings("unchecked")<a name="line.604"></a>
<span class="sourceLineNo">605</span>      K key = (K) stream.readObject();<a name="line.605"></a>
<span class="sourceLineNo">606</span>      @SuppressWarnings("unchecked")<a name="line.606"></a>
<span class="sourceLineNo">607</span>      V value = (V) stream.readObject();<a name="line.607"></a>
<span class="sourceLineNo">608</span>      map.get(key).add(value);<a name="line.608"></a>
<span class="sourceLineNo">609</span>    }<a name="line.609"></a>
<span class="sourceLineNo">610</span>    setMap(map);<a name="line.610"></a>
<span class="sourceLineNo">611</span>  }<a name="line.611"></a>
<span class="sourceLineNo">612</span><a name="line.612"></a>
<span class="sourceLineNo">613</span>  @GwtIncompatible("java serialization not supported")<a name="line.613"></a>
<span class="sourceLineNo">614</span>  private static final long serialVersionUID = 1;<a name="line.614"></a>
<span class="sourceLineNo">615</span>}<a name="line.615"></a>




























































</pre>
</div>
</body>
</html>
